Fronts Propagating with Curvature Dependent Speed: Algorithms Based on Hamilton-Jacobi Formulations

نویسندگان

  • Stanley Osher
  • James A. Sethian
چکیده

We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvature-dependent speed. The speed may be an arbitrary function of curvature, and the front can also be passively advected by an underlying flow. These algorithms approximate the equations of motion, which resemble Hamilton-Jacobi equations with parabolic right-hand-sides, by using techniques from the hyperbolic conservation laws. Non-oscillatory schemes of various orders of accuracy are used to solve the equations, providing methods that accurately capture the formation of sharp gradients and cusps in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be also used for more general Hamilton-Jacobitype problems. We demonstrate our algorithms by computing the solution to a variety of surface motion problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effect of initial conditions on the speed of reaction-diffusion fronts.

The effect of initial conditions on the speed of propagating fronts in reaction-diffusion equations is examined in the framework of the Hamilton-Jacobi theory. We study the transition between quenched and nonquenched fronts both analytically and numerically for parabolic and hyperbolic reaction diffusion. Nonhomogeneous media are also analyzed and the effect of algebraic initial conditions is a...

متن کامل

Dynamic Tubular Grid: An Efficient Data Structure and Algorithms for High Resolution Level Sets

Level set methods [Osher and Sethian. Fronts propagating with curvaturedependent speed: algorithms based on Hamilton–Jacobi formulations. J. Comput. Phys. 79 (1988) 12] have proved very successful for interface tracking in many different areas of computational science. However, current level set methods are limited by a poor balance between computational efficiency and storage requirements. Tre...

متن کامل

A fast marching level set method for monotonically advancing fronts.

A fast marching level set method is presented for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques for computing the position of propagating fronts. They rely on an initial value partial differential equation for a propagating level set function and use techniques borrowed from hyperbolic conserv...

متن کامل

Lower Bound Gradient Estimates for First-order Hamilton-jacobi Equations and Applications to the Regularity of Propagating Fronts

This paper is concerned with rst-order time-dependent Hamilton-Jacobi Equations. Exploiting some ideas of Barron and Jensen 9], we derive lower bound estimates for the gradient of a locally Lipschitz continuous viscosity solution u of equations with a convex Hamiltonian. Using these estimates in the context of the level-set approach to front propagation, we investigate the regularity properties...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987